Ohio State University Mathematical Research Institute Publications
-
Edited by:
Gregory R. Baker
This series is devoted to the publication of monographs, lecture resp. seminar notes, and other materials arising from programs of the OSU Mathemaical Research Institute. This includes proceedings of conferences or workshops held at the Institute, and other mathematical writings.
This volume is the proceedings of the conference on Automorphic Representations, L-functions and Applications: Progress and Prospects, held at the Department of Mathematics of The Ohio State University, March 27–30, 2003, in honor of the 60th birthday of Steve Rallis.
The theory of automorphic representations, automorphic L-functions and their applications to arithmetic continues to be an area of vigorous and fruitful research. The contributed papers in this volume represent many of the most recent developments and directions, including
- Rankin–Selberg L-functions (Bump, Ginzburg–Jiang–Rallis, Lapid–Rallis)
- the relative trace formula (Jacquet, Mao–Rallis)
- automorphic representations (Gan–Gurevich, Ginzburg–Rallis–Soudry)
- representation theory of p-adic groups (Baruch, Kudla–Rallis, Mœglin, Cogdell–Piatetski-Shapiro–Shahidi)
- p-adic methods (Harris–Li–Skinner, Vigneras), and
- arithmetic applications (Chinta–Friedberg–Hoffstein).
The survey articles by Bump, on the Rankin–Selberg method, and by Jacquet, on the relative trace formula, should be particularly useful as an introduction to the key ideas about these important topics.
This volume should be of interest both to researchers and students in the area of automorphic representations, as well as to mathematicians in other areas interested in having an overview of current developments in this important field.
Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory. Between May 18-21, 2000, the 25th conference of this series was held. Usually, there are twenty to thirty invited 20-minute talks in each of the three main areas. However, at the 2000 meeting, the combinatorics part of the conference was extended, to honor the 65th birthday of Professor Dijen Ray-Chaudhuri. This volulme is the proceedings of this extension. Most of the papers are in coding theory and design theory, reflecting the major interest of Professor Ray-Chaudhuri, but there are articles on association schemes, algebraic graph theory, combinatorial geometry, and network flows as well. There are four surveys and seventeen research articles, and all of these went through a thorough refereeing process. The volume is primarily recommended for researchers and graduate students interested in new developments in coding theory and design theory.
This volume is the proceedings of a conference held at Ohio State University in May of 1999. Over sixty mathematicians from around the world participated in this conference and principal lectures were given by some of the most distinguished experts in the field. The proceedings volume contains fully refereed research articles from some of the principal speakers, including: Salah Baouendi (UCSD), David Barrett (Univ. Michigan), Bo Berndtsson (Goteborg), David Catlin (Purdue Univ.), Micheal Christ (Berkeley), John D'Angelo (Univ. Illinois), Xiaojun Huang (Rutgers), J. J. Kohn (Princeton), Y.-T. Siu (Harvard), and Emil Straube (Texas A & M).
This volume contains contributions by the participants of the conference "Groups and Computation", which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on "Groups and Computation" held at DIMACS in 1991 and 1995.
There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field.
The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.
